Critical hazard free test generation for asynchronous circuits
نویسندگان
چکیده
We describe a technique to generate critical hazard-free tests for self-timed control circuits build using a macromodule library, in a partial scan based DFT environment. We propose a 6 valued algebra to generate these tests which are guaranteed to be critical hazard free under an unbounded delay model. This algebra has been incorporated in a D-algorithm based automatic test pattern generato,:
منابع مشابه
Synthesis for Testability Techniques for Asynchronous Circuits
Our goal is to synthesize hazard-free asynchronous circuits that are testable in the very stringent hazard-free robust path-delay-fault model. From a synthesis perspective producing circuits satisfying two very stringent requirements, namely, hazard-free operation and hazard-free robust path-delay-fault-testability, poses an especially exciting challenge. In this paper we present techniques whi...
متن کاملSynthesis-for-Initializability of Asynchronous Sequential Machines
We present a new method for the synthesis-forinitializability of asynchronous state machines. Unlike existing approaches, our method incorporates a state assignment step. State assignment is critical, since initializability may be precluded by poor choice of state assignment. Also, we present precise conditions on hazard-free logic, to insure that the circuits are physically initializable.
متن کاملPolynomial Algorithms for the Synthesis of Hazard-free Circuits from Signal Transition Graphs
Methods for the synthesis of asynchronous circuits from Signal Transition Graphs (STGs) have commonly used the State Graph to solve the two main steps of this process: the state assignment problem and the generation of hazard-free logic. The size of the State Graph can be of order O(2 n), where n is the number of signals of the circuit. As synthesis tools for asynchronous systems start to matur...
متن کاملPolynomial Algorithms for Complete State Coding and Synthesis of Hazard-free Circuits from Signal Transition Graphs
Methods for the synthesis of asynchronous circuits from Signal Transition Graphs (STGs) have commonly used the State Graph to solve the two main steps of this process: the state assignment problem and the generation of hazard-free logic. The size of the State Graph can be of order O(2 n), where n is the number of signals of the circuit. As synthesis tools for asynchronous systems start to matur...
متن کاملSynthesis of asynchronous circuits for stuck-at and robust path delay fault testability
In this paper, we present methods for synthesizing multi-level asynchronous circuits to be both hazard-free and completely testable. Making an asynchronous two-level circuit hazard-free usually requires the introduction of either redundant or non-prime cubes, or both. This adversely a ects its testability. However, using extra inputs, which is seldom necessary, and a synthesis for testability m...
متن کامل